Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
نویسنده
چکیده
A fast and simple O(logn) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a √ 5 conversion factor gives a faster Fibonacci algorithm because the speed up proposed in [5] also directly applies. A fast simple recursive algorithm for individual Lucas numbers is given that is O(logn).
منابع مشابه
Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci
Two very fast and simple O(lg n) iteration algorithms for individual Fibonacci numbers are given and compared to competing algorithms. A simple O(lg n) recursion is derived that can also be applied to Lucas. A formula is given to estimate the largest n, where Fn does not overflow the implementation’s data type. The danger of timing runs on input that is too large for the computer representation...
متن کاملParallel Algorithms for Shared-memory Machines. a Standard Wasteful Implementation
10 technique enables a simple cost-eeective implementation with little eeort. It was used for the rst time to implement a fast optimal parallel hashing algorithm 7]. The hashing algorithm in 7] comprises two parts: the rst part is a randomized geometric decaying algorithm which runs for O(lg lg n) steps. By using the technique of this paper and the O(lg lg n) time load balancing of 6], this par...
متن کاملSimple Fast Parallel Hashing by Oblivious Execution
A hash table is a representation of a set in a linear size data structure that supports constant-time membership queries. We show how to construct a hash table for any given set of n keys in O(lg lg n) parallel time with high probability, using n processors on a weak version of a concurrent-read concurrent-write parallel random access machine (crcw pram). Our algorithm uses a novel approach of ...
متن کاملFast computation of Bernoulli, Tangent and Secant numbers
We consider the computation of Bernoulli, Tangent (zag), and Secant (zig or Euler) numbers. In particular, we give asymptotically fast algorithms for computing the first n such numbers in O(n2(logn)2+o(1)) bit-operations. We also give very short in-place algorithms for computing the first n Tangent or Secant numbers in O(n2) integer operations. These algorithms are extremely simple, and fast fo...
متن کاملQuantum Algorithms for Finding Extrema with Unary Predicates
We study the problem of finding the maximum or the minimum of a given set S = {x0, x1, . . . xn−1}, each element xi drawn from some finite universe U of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the form ”Is xi greater than, equal to, or less than some constant k?” Classically, this problem is solved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1012.0284 شماره
صفحات -
تاریخ انتشار 2010